Distributed Storage Control Algorithms for Dynamic Networks
نویسندگان
چکیده
منابع مشابه
Reconfigurable Distributed Storage for Dynamic Networks
This paper presents a new algorithm for implementing a reconfigurable distributed shared memory in an asynchronous dynamic network. The algorithm guarantees atomic consistency (linearizability) in all executions in the presence of arbitrary crash failures of the processing nodes, message delays, and message loss. The algorithm incorporates a classic quorum-based algorithm for read/write operati...
متن کاملDistributed Dynamic Storage in Wireless Networks
This paper assumes a set of identical wireless hosts, each one aware of its location. The network is described by a unit distance graph whose vertices are points on the plane two of which are connected if their distance is at most one. The goal of this paper is to design local distributed solutions that require a constant number of communication rounds, independently of the network size or diam...
متن کاملDistributed power control algorithms for wireless networks
Power control has been shown to be an effective way to increase capacity in wireless systems. In previous work on power control, it has been assumed that power levels can be assigned from a continuous range. In practice, however, power levels are assigned from a discrete set. In this work, we consider the minimization of the total power transmitted over given discrete sets of available power le...
متن کاملDistributed Flooding-based Storage Algorithms for Large-scale Sensor Networks
In this paper we propose distributed storage algorithms for large-scale wireless sensor networks. Assume a wireless sensor network with n nodes that have limited power, memory, and bandwidth. Each node is capable of both sensing and storing data. Such sensor nodes might disappear from the network due to failures or battery depletion. Hence it is desired to design efficient schemes to collect da...
متن کاملLocal Distributed Algorithms in Highly Dynamic Networks
The present paper studies local distributed graph problems in highly dynamic networks. We define a (in our view) natural generalization of static graph problems to the dynamic graph setting. For some parameter T > 0, the set of admissible outputs of nodes in a T -dynamic solution for a given graph problem at some time t is defined by the dynamic graph topology in the time interval [t − T, t]. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/ACM Transactions on Networking
سال: 2017
ISSN: 1063-6692,1558-2566
DOI: 10.1109/tnet.2016.2633370